Almost-Tiling the Plane by Ellipses
نویسندگان
چکیده
Let C be a system (finite or infinite) of centrally symmetric convex bodies in IR with disjoint interiors; we call such a C a packing . For a real number ε > 0 and for C ∈ C, we let C denote C enlarged by the factor 1+ ε from its center, that is, C = (1+ ε)(C − c) + c, where c stands for the center of symmetry C. Let us call the closure of the set C \C the ε-ring of C. We call the system C = {C; C ∈ C} the (1 + ε)-enlargement of C.
منابع مشابه
Time-frequency structured decorrelation of speech signals via nonseparable Gabor frames
We present a new approach to the linear representation of speech signals that combines desirable structure, computational e ciency and almost decorrelation. The basic principle is a statistically adapted, group{theoretical modi cation of the classical Gabor expansion. In contrast to traditional linear time{frequency (TF) representations which always correspond to a separable tiling of the TF pl...
متن کاملA certified algorithm for the InCircle predicate among ellipses
This paper examines the InCircle predicate among ellipses in the Euclidean plane, under the exact computation paradigm. The ellipses are non-intersecting and given in parametric representation. We present a subdivision-based algorithm and implement it in Maple and CORE.
متن کاملA hierarchical strongly aperiodic set of tiles in the hyperbolic plane
We give a new construction of strongly aperiodic set of tiles in H, exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that the Domino problem is undecidable in the hyperbolic plane [13]. Ludwig Danzer once asked whether, in the hyperbolic plane, where there are no similarities, there could be any notion of hierarchical tiling—an idea which pla...
متن کاملThe Finite Tiling Problem is Undecidable in the Hyperbolic Plane
In this paper, we consider the nite tiling problem which was proved undecidable in the Euclidean plane by Jarkko Kari, see [4]. Here, we prove that the same problem for the hyperbolic plane is also undecidable.
متن کاملConstructing Kaleidoscopic Tiling Polygons in the Hyperbolic Plane
We have all seen many of the beautiful patterns obtained by tiling the hyperbolic plane H by repeated reflection in the sides of a "kaleidoscopic" polygon. Though there are such patterns on the sphere and the euclidean plane, these positively curved and fiat geometries lack the richness we see in the hyperbolic plane. Many of these patterns have been popularized by the beautiful art of M.C. Esc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 22 شماره
صفحات -
تاریخ انتشار 1999